Practical Inner Product Encryption with Constant Private Key
نویسندگان
چکیده
منابع مشابه
A New Approach for Practical Function-Private Inner Product Encryption
Functional Encryption (FE) is a new paradigm supporting restricted decryption keys of function f that allows one to learn f(xj) from encryptions of messages xj . A natural and practical security requirements for FE is to keep not only messages x1, . . . , xq but also functions f1, . . . fq confidential from encryptions and decryptions keys, except inevitable information {fi(xj)}i,j∈[q], for any...
متن کاملFunction-Hiding Inner Product Encryption is Practical
In a functional encryption scheme, secret keys are associated with functions and ciphertexts are associated with messages. Given a secret key for a function f and a ciphertext for a message x, a decryptor learns f(x) and nothing else about x. Inner product encryption is a special case of functional encryption where both secret keys and ciphertexts are associated with vectors. The combination of...
متن کاملOn the Practical Security of Inner Product Functional Encryption
Functional Encryption (FE) is an exciting new paradigm that extends the notion of public key encryption. In this work we explore the security of Inner Product Functional Encryption schemes with the goal of achieving the highest security against practically feasible attacks. While there has been substantial research effort in defining meaningful security models for FE, known definitions run into...
متن کاملFunction-Hiding Inner Product Encryption
We extend the reach of functional encryption schemes that are provably secure under simpleassumptions against unbounded collusion to include function-hiding inner product schemes.Our scheme is a private key functional encryption scheme, where ciphertexts correspond tovectors ~x, secret keys correspond to vectors ~y, and a decryptor learns 〈~x, ~y〉. Our schemeemploys asymmetr...
متن کاملPrivate-key Symbolic Encryption Schemes
Symbolic encryption, in the style of Dolev-Yao models, is ubiquitous in formal security analysis aiming at the automated verification of network protocols. The näıve use of symbolic encryption, however, may unnecessarily require an expensive construction: an arbitrary-length encryption scheme that is private and non-malleable in an adaptive CCACPA setting. Most of the time, such assumptions rem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2020
ISSN: 2076-3417
DOI: 10.3390/app10238669